@inproceedings{KRT09,
  author    = {D. Klein and F. G. Radmacher and W. Thomas},
  title     = {The Complexity of Reachability in Randomized Sabotage Games},
  booktitle = {Proceedings of the 3rd International Conference on Fundamentals of Software Engineering (FSEN'09)},
  year      = {2009},
  pages     = {162--177}
}

@inproceedings{CO71,
 author = {S. A. Cook},
 title = {The complexity of theorem-proving procedures},
 booktitle = {Proceedings of the 3rd annual ACM symposium on Theory of computing (STOC'71)},
 year = {1971},
 pages = {151--158},
}

@article{PAP85,
 author = {C. H. Papadimitriou},
 title = {Games against nature},
 journal = {Journal of Computer and System Sciences},
 volume = {31},
 number = {2},
 year = {1985},
 pages = {288--301}
 }
 
@article{LEH64,
 author = {A. Lehman},
 title = {A Solution of the Shannon Switching Game},
 journal = {Journal of the Society for Industrial and Applied Mathematics},
 volume = {12},
 number = {4},
 year = {1964},
 pages = {687--725}
}
 

@INPROCEEDINGS{DEM01,
    author = {E. D. Demaine},
    title = {Playing games with algorithms: Algorithmic combinatorial game theory},
    booktitle = {Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science (MFCS'01)},
    year = {2001},
    pages = {18--33}
}
 

@PHDTHESIS{ROH05,
  author = {P. Rohde},
  title = {On Games and Logics over Dynamically Changing Structures},
  school = {RWTH Aachen University},
  year = {2005},
  address = {Aachen, Germany},
  month = {December}
}


@inproceedings{ST73,
 author = {L. J. Stockmeyer and A. R. Meyer},
 title = {Word problems requiring exponential time(Preliminary Report)},
 booktitle = {Proceedings of the 5th annual ACM symposium on Theory of computing (STOC'73)},
 year = {1973},
 pages = {1--9},
} 


@inproceedings{RT07,
  author    = {F. G. Radmacher and W. Thomas},
  title     = {A Game Theoretic Approach to the Analysis of Dynamic Networks},
  booktitle = {Proceedings of the 1st Workshop on Verification of Adaptive Systems (VerAS'07)},
  year      = {2007},
  pages     = {21--37}
}


@inproceedings{GRT10,
  author    = {J. Gross and F. G. Radmacher and W. Thomas},
  title     = {A game-theoretic approach to routing under adversarial conditions},
  booktitle = {Proceedings of the 6th IFIP International Conference on Theoretical Computer Science (TCS'10)},
  year      = {2010},
  pages     = {355--370}
}

@inproceedings{Ben05,
  author    = {J. van Benthem},
  title     = {An Essay on Sabotage and Obstruction},
  booktitle = {Mechanizing Mathematical Reasoning, Essays in Honor of J{\"o}rg H.\ Siekmann on the Occasion of His 60th Birthday},
  year      = {2005},
  pages     = {268--276},
}


@INPROCEEDINGS{LR03b,
  author       = {C. L{\"o}ding and P. Rohde},
  title        = {Solving the Sabotage Game is {PSPACE}-hard},
  booktitle    = {Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science (MFCS'03)},
  pages        = {531--540},
  year         = 2003,
  ps           = {/download/papers/rohde/mfcs03.ps.gz},
  pdf          = {/download/papers/rohde/mfcs03.pdf},
  copyright    = {\copyright \url{http://www.springer.de/comp/lncs/}{Springer}},
  abstract     = {
We consider the sabotage game as presented by van Benthem. In this game one player moves along
the edges of a finite multi-graph and the other player takes out a link after each step. One can
consider usual algorithmic tasks like reachability, Hamilton path, or complete search as winning
conditions for this game. As the game definitely ends after at most the number of edges steps, it is
easy to see that solving the sabotage game for the mentioned tasks takes at most PSPACE in the size
of the graph. In this paper we establish the PSPACE-hardness of this problem. Furthermore, we
introduce a modal logic over changing models to express tasks corresponding to the sabotage games
and we show that model checking this logic is PSPACE-complete.},
}

@book{dimi,
  author =    {C. H.\ Papadimitriou},
  title =     {Computational Complexity},
  publisher = {Addison Wesley},
  year =      {1994},
}

@ARTICLE{FKMR07,
    author = {S. Finbow and A. King and G. MacGillivray and R. Rizzi},
    title = {The firefighter problem for graphs of maximum degree three},
    journal = {Discrete Mathematics},
    year = {2007},
    volume = {307},
    pages = {2094--2105}
}

@article{KG10,
author ="A. King and G. MacGillivray",
title = "The firefighter problem for cubic graphs",
journal = "Discrete Mathematics",
volume = "310",
number = "3",
pages = "614 - 621",
year = "2010",
note = "Sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications"
}


@MISC{H95,
    author = {B. L. Hartnell},
    title = {Firefighter! An application of domination},
    booktitle = {Presentation in the 24th Manitoba Conference on Combinatorial Mathematics and
Computing},
    year = 1995,
}
